- arithmetical computing machine
- n.算术计算机
English-Chinese dictionary of mining (英汉矿业大词典). 2013.
arithmetical computing machine
Look at other dictionaries:
Machine that always halts — In computability theory, a machine that always halts also called a decider (Sipser, 1996) or a total Turing machine (Kozen, 1997) is a Turing machine that halts for every input. Because it always halts, the machine is able to decide whether a… … Wikipedia
Turing machine — For the test of artificial intelligence, see Turing test. For the instrumental rock band, see Turing Machine (band). Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine… … Wikipedia
Timeline of computing hardware 2400 BC–1949 — History of computing Hardware before 1960 Hardware 1960s to present Hardware in Soviet Bloc countries Artificial intelligence Computer science Operating systems Programming languages … Wikipedia
Register machine — In mathematical logic and theoretical computer science a register machine is a generic class of abstract machines used in a manner similar to a Turing machine. All the models are Turing equivalent. Contents 1 Overview 2 Formal definition 3 … Wikipedia
Oracle machine — In complexity theory and computability theory, an oracle machine is an abstract machine used to study decision problems. It can be visualized as a Turing machine with a black box, called an oracle, which is able to decide certain decision… … Wikipedia
Wang B-machine — As presented by Hao Wang (1954, 1957), his basic machine B is an extremely simple computational model equivalent to the Turing machine. It is the first formulation of a Turing machine theory in terms of computer like models (Minsky (1967) p. 200) … Wikipedia
computer — computerlike, adj. /keuhm pyooh teuhr/, n. 1. Also called processor. an electronic device designed to accept data, perform prescribed mathematical and logical operations at high speed, and display the results of these operations. Cf. analog… … Universalium
History of the Church–Turing thesis — This article is an extension of the history of the Church–Turing thesis. The debate and discovery of the meaning of computation and recursion has been long and contentious. This article provides detail of that debate and discovery from Peano s… … Wikipedia
History of the Church-Turing thesis — This article is an extension of the history of the Church Turing thesis.The debate and discovery of the meaning of computation and recursion has been long and contentious. This article provides detail of that debate and discovery from Peano s… … Wikipedia
digital computer — noun a computer that represents information by numerical (binary) digits • Hypernyms: ↑computer, ↑computing machine, ↑computing device, ↑data processor, ↑electronic computer, ↑information processing system … Useful english dictionary
George Stibitz — George Robert Stibitz (April 20, 1904 – January 31, 1995) is internationally recognized as one of the fathers of the modern digital computer. He was a Bell Labs researcher known for his work in the 1930s and 1940s on the realization of Boolean… … Wikipedia
